Set cover problem - PDFSEARCH.IO - Document Search Engine

Set cover problem
Results: 76

#	Item
51	Implicit Hitting Set Problems, Multi-Genome Alignment and Colorful Connected Subgraphs Richard M. Karp CPM New York, June, 2010 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:40 Combinatorics Matroid theory Combinatorial optimization Set cover problem Matroid Feedback vertex set Maximum cut Greedy algorithm Mathematics Theoretical computer science NP-complete problems
52	To appear in the Intl. J. of Robotics Research Also Technical Report CRES, Center for Robotics and Embedded Systems, USC, July 2003 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Add to Reading List Source URL: cres.usc.edu Language: English - Date: 2004-06-08 10:49:29 Operations research Linear programming Combinatorial optimization NP-complete problems Greedy algorithm Robot Assignment problem Algorithm Set cover problem Mathematics Theoretical computer science Applied mathematics
53	The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-12-02 06:14:39 NP-complete problems Matroid theory Operations research Submodular set function Matroid Greedy algorithm Set cover problem Linear programming Algorithm Mathematics Theoretical computer science Applied mathematics
54	Hardness of Set Cover with Interse tion 1 V.S.Anil Kumar1 , Sunil Arya2 and H.Ramesh3 MPI fur Informatik, Saarbru ken. kumarmpi-sb.mpg.de Department of Computer S ien e, Hong Kong University of S ien e and Te hnology. Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:28:02 NP-complete problems Set cover problem Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
55	The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch† Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:17:36 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Set cover problem Competitive analysis Algorithm Randomized rounding Euclidean algorithm Mathematics Theoretical computer science Applied mathematics
56	Crawling Deep Web Using a New Set Covering Algorithm Yan Wang1 , Jianguo Lu12 , and Jessica Chen1 1 2 Add to Reading List Source URL: jlu.myweb.cs.uwindsor.ca Language: English - Date: 2009-10-20 21:31:39 NP-complete problems Greedy algorithm Matroid theory Information retrieval Algorithm Invisible Web Set cover problem Mathematics Combinatorics Applied mathematics
57	Édouard Bonnet Paris Dauphine - LAMSADE Computer Science Department Place du Maréchal de Lattre de TassignyParis Add to Reading List Source URL: www.lamsade.dauphine.fr Language: English - Date: 2015-04-20 04:47:40 Parameterized complexity Time complexity Approximation algorithm Vangelis Complexity Set cover problem Cut Theoretical computer science Computational complexity theory Applied mathematics
58	Adaptive Greedy Approximations1 Georey Davis Mathematics Department, Dartmouth College Hanover, NHStephane Mallat, Marco Avellaneda Add to Reading List Source URL: www.geoffdavis.net Language: English NP-complete problems Complexity classes Combinatorial optimization Approximation algorithm NP Set cover problem Reduction Matching pursuit Matching Theoretical computer science Computational complexity theory Applied mathematics
59	Newsletter of the PC Community November 2011 Welcome Frances Rosamond, Editor Congratulations to Serge Gaspers and Mohammad Taghi Hajiaghayi for multiple awards, to Yoichi Iwata for the IPEC Excellent Student Paper award Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:09:27 NP-complete problems Parameterized complexity Kernelization NP-complete Bidimensionality Dominating set Clique problem Feedback vertex set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
60	Essential Web Pages Are Easy to Find Ricardo Baeza-Yates∗ Paolo Boldi† Flavio Chierichetti‡ Add to Reading List Source URL: labs.yahoo.com Language: English - Date: 2015-02-18 18:58:55 Applied mathematics Set cover problem Greedy algorithm Maximum coverage problem Algorithm Vertex cover Ordinal number Euclidean algorithm Dominating set Mathematics NP-complete problems Theoretical computer science